Endomorphism Spectrums and Endomorphism Types of Graphs
نویسندگان
چکیده
In this paper, the endomorphisms, the half-strong endomorphisms, the locally strong endomorphisms, the quasi-strong endomorphisms, the strong endomorphisms and the automorphisms of a join of cycle n C and a vertex y are investigated. Some enumerative problems concerning these graphs are solved. In particular, the endomorphism spectrums and the endomorphism types of these graphs are given. It has a wide range of applications in Information Science.
منابع مشابه
On Graphs With a Given
On Graphs With A Given Endomorphism Monoid Benjamin Shemmer Hedrĺın and Pultr proved that for any monoid M there exists a graph G with endomorphism monoid isomorphic to M. We will give a construction G(M) for a graph with prescribed endomorphism monoid M. Using this construction we derive bounds on the minimum number of vertices and edges required to produce a graph with a given endomorphism mo...
متن کاملAbsolute Graphs with Prescribed Endomorphism Monoid
We consider endomorphism monoids of graphs. It is well-known that any monoid can be represented as the endomorphism monoid M of some graph Γ with countably many colors. We give a new proof of this theorem such that the isomorphism between the endomorphism monoid End(Γ) and M is absolute, i.e. End(Γ) ∼= M holds in any generic extension of the given universe of set theory. This is true if and onl...
متن کاملDistributive lattices with strong endomorphism kernel property as direct sums
Unbounded distributive lattices which have strong endomorphism kernel property (SEKP) introduced by Blyth and Silva in [3] were fully characterized in [11] using Priestley duality (see Theorem 2.8}). We shall determine the structure of special elements (which are introduced after Theorem 2.8 under the name strong elements) and show that these lattices can be considered as a direct product of ...
متن کاملEndomorphism Breaking in Graphs
We introduce the endomorphism distinguishing number De(G) of a graph G as the least cardinal d such that G has a vertex coloring with d colors that is only preserved by the trivial endomorphism. This generalizes the notion of the distinguishing number D(G) of a graph G, which is defined for automorphisms instead of endomorphisms. As the number of endomorphisms can vastly exceed the number of au...
متن کامل$PI$-extending modules via nontrivial complex bundles and Abelian endomorphism rings
A module is said to be $PI$-extending provided that every projection invariant submodule is essential in a direct summand of the module. In this paper, we focus on direct summands and indecomposable decompositions of $PI$-extending modules. To this end, we provide several counter examples including the tangent bundles of complex spheres of dimensions bigger than or equal to 5 and certain hyper ...
متن کامل